Importance Sampling Spherical Harmonics

نویسندگان

  • Wojciech Jarosz
  • Nathan A. Carr
  • Henrik Wann Jensen
چکیده

In this paper we present the first practical method for importance sampling functions represented as spherical harmonics (SH). Given a spherical probability density function (PDF) represented as a vector of SH coefficients, our method warps an input point set to match the target PDF using hierarchical sample warping. Our approach is efficient and produces high quality sample distributions. As a by-product of the sampling procedure we produce a multi-resolution representation of the density function as either a spherical mip-map or Haar wavelet. By exploiting this implicit conversion we can extend the method to distribute samples according to the product of an SH function with a spherical mip-map or Haar wavelet. This generalization has immediate applicability in rendering, e.g., importance sampling the product of a BRDF and an environment map where the lighting is stored as a single high-resolution wavelet and the BRDF is represented in spherical harmonics. Since spherical harmonics can be efficiently rotated, this product can be computed on-the-fly even if the BRDF is stored in local-space. Our sampling approach generates over 6 million samples per second while significantly reducing precomputation time and storage requirements compared to previous techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and accurate rotation of finite spherical harmonics expansions

Spherical harmonics are employed in a wide range of applications in computational science and physics, and many of them require the rotation of functions. We present an efficient and accurate algorithm for the rotation of finite spherical harmonics expansions. Exploiting the pointwise action of the rotation group on functions on the sphere, we obtain the spherical harmonics expansion of a rotat...

متن کامل

Fast Spin ±2 Spherical Harmonics Transforms

An exact fast algorithm is developed for the direct spin-weighted spherical harmonics transforms of bandlimited spin ±2 functions on the sphere. First, we define spin functions on the sphere and their decomposition in an orthonormal basis of spin-weighted spherical harmonics. Second, we discuss the a priori O(L4) asymptotic complexity of the spin ±2 spherical harmonics transforms, where 2L stan...

متن کامل

Fast spin ±2 spherical harmonics transforms and application in cosmology

An exact fast algorithm is developed for the spin-weighted spherical harmonics transforms of band-limited spin ±2 functions on the sphere. First, we recall the notion of spin functions on the sphere and their decomposition in an orthonormal basis of spin-weighted spherical harmonics. Second, we discuss the a priori O(L4) asymptotic complexity of the spin ±2 spherical harmonics transforms, where...

متن کامل

Error estimates for scattered data interpolation on spheres

We study Sobolev type estimates for the approximation order resulting from using strictly positive definite kernels to do interpolation on the n-sphere. The interpolation knots are scattered. Our approach partly follows the general theory of Golomb and Weinberger and related estimates. These error estimates are then based on series expansions of smooth functions in terms of spherical harmonics....

متن کامل

Efficient Hair Rendering under Dynamic, Low-Frequency Environmental Light Using Spherical Harmonics

We present an algorithm for efficient rendering of animated hair under a dynamic, low-frequency lighting environment. We use spherical harmonics (SH) to represent the environmental light. The transmittances between a point on a hair strand and the light sources are also represented by SH functions. Then, a convolution of SH functions and the scattering function of a hair strand is precomputed. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009